type github.com/andybalholm/brotli.h10

19 uses

	github.com/andybalholm/brotli (current package)
		backward_references_hq.go#L624: func zopfliComputeShortestPath(num_bytes uint, position uint, ringbuffer []byte, ringbuffer_mask uint, params *encoderParams, dist_cache []int, hasher *h10, nodes []zopfliNode) uint {
		backward_references_hq.go#L683: func createZopfliBackwardReferences(num_bytes uint, position uint, ringbuffer []byte, ringbuffer_mask uint, params *encoderParams, hasher *h10, dist_cache []int, last_insert_len *uint, commands *[]command, num_literals *uint) {
		backward_references_hq.go#L742: 		num_found_matches = findAllMatchesH10(hasher.(*h10), &params.dictionary, ringbuffer, ringbuffer_mask, pos, max_length, max_distance, gap, params, matches[cur_match_pos+shadow_matches:])
		encode.go#L839: 		createZopfliBackwardReferences(uint(bytes), uint(wrapped_last_processed_pos), data, uint(mask), &s.params, s.hasher_.(*h10), s.dist_cache_[:], &s.last_insert_len_, &s.commands, &s.num_literals_)
		h10.go#L11: func (*h10) HashTypeLength() uint {
		h10.go#L15: func (*h10) StoreLookahead() uint {
		h10.go#L33: type h10 struct {
		h10.go#L41: func (h *h10) Initialize(params *encoderParams) {
		h10.go#L48: func (h *h10) Prepare(one_shot bool, input_size uint, data []byte) {
		h10.go#L56: func leftChildIndexH10(self *h10, pos uint) uint {
		h10.go#L60: func rightChildIndexH10(self *h10, pos uint) uint {
		h10.go#L74: func storeAndFindMatchesH10(self *h10, data []byte, cur_ix uint, ring_buffer_mask uint, max_length uint, max_backward uint, best_len *uint, matches []backwardMatch) []backwardMatch {
		h10.go#L162: func findAllMatchesH10(handle *h10, dictionary *encoderDictionary, data []byte, ring_buffer_mask uint, cur_ix uint, max_length uint, max_backward uint, gap uint, params *encoderParams, matches []backwardMatch) uint {
		h10.go#L230: func (h *h10) Store(data []byte, mask uint, ix uint) {
		h10.go#L236: func (h *h10) StoreRange(data []byte, mask uint, ix_start uint, ix_end uint) {
		h10.go#L254: func (h *h10) StitchToPreviousBlock(num_bytes uint, position uint, ringbuffer []byte, ringbuffer_mask uint) {
		h10.go#L281: func (*h10) FindLongestMatch(dictionary *encoderDictionary, data []byte, ring_buffer_mask uint, distance_cache []int, cur_ix uint, max_length uint, max_backward uint, gap uint, max_distance uint, out *hasherSearchResult) {
		h10.go#L285: func (*h10) PrepareDistanceCache(distance_cache []int) {
		hash.go#L260: 		return new(h10)